Inclusion Weierstrass-like root-finders with corrections
نویسندگان
چکیده
منابع مشابه
Some Improved Inclusion Methods for Polynomial Roots with Weierstrass' Corrections
1. I N T R O D U C T I O N Let P be a monic complex polynomial of degree n >_ 3 with simple zeros (1 , . . , (,, and let Zl , . . . , z , be distinct approximations of these zeros. Then an arbitrary zero can be expressed by (j zj _ ,,WJ , ( j 1,. . . , n) (1) 1 w k=l,k~j (see [3,4]), where = . P(z ) (2) k= l ,k#j is the so-called Weierstrass' correction [5]. Suppose that we have found disjoint ...
متن کاملEuler-like Method for the Simultaneous Inclusion of Polynomial Zeros with Weierstrass’ Correction
An improved iterative method of Euler’s type for the simultaneous inclusion of polynomial zeros is considered. To accelerate the convergence of the basic method of fourth order, Carstensen-Petković’s approach [7] using Weierstrass’ correction is applied. It is proved that the R-order of convergence of the improved Euler-like method is (asymptotically) 2 + √ 7 ≈ 4.646 or 5, depending of the type...
متن کاملLaguerre-like Methods with Corrections for the Inclusion of Polynomial Zeros
Iterative methods of Laguerre’s type for the simultaneous inclusion of all zeros of a polynomial are proposed. Using Newton’s and Halley’s corrections, the order of convergence of the basic method is increased from 4 to 5 and 6, respectively. Further improvements are achieved by the Gauss-Seidel approach. Using the concept of the R-order of convergence of mutually dependent sequences, we presen...
متن کاملA case study for constrained learning neural root finders
This paper makes the detailed analyses of computational complexities and related parameters selection on our proposed constrained learning neural network root-finders including the original feedforward neural network root-finder (FNN-RF) and the recursive partitioning feedforward neural network root-finder (RP-FNN-RF). Specifically, we investigate the case study of the CLA used in neural root-f...
متن کاملOptimal eighth-order simple root-finders free from derivative
The calculation of derivatives of a function mostly takes up a great deal of time and even in some cases, such as the existing problems in engineering and optimization, is impossible to be evaluated directly. Accordingly, an accurate derivative-free class of three-step methods is suggested for solving ( ) = 0. The proposed three-step technique comprises four evaluations of the function per iter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2003
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil0317143p